<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    260. Single Number III
   </h1>
   <p>
    Given an array of numbers
    <code>
     nums
    </code>
    , in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>  <code>[1,2,1,3,2,5]</code>
<strong>Output:</strong> <code>[3,5]</code></pre>
   <p>
    <b>
     Note
    </b>
    :
   </p>
   <ol>
    <li>
     The order of the result is not important. So in the above example,
     <code>
      [5, 3]
     </code>
     is also correct.
    </li>
    <li>
     Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    260. 只出现一次的数字 III
   </h1>
   <p>
    给定一个整数数组&nbsp;
    <code>
     nums
    </code>
    ，其中恰好有两个元素只出现一次，其余所有元素均出现两次。 找出只出现一次的那两个元素。
   </p>
   <p>
    <strong>
     示例 :
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>[1,2,1,3,2,5]</code>
<strong>输出:</strong> <code>[3,5]</code></pre>
   <p>
    <strong>
     注意：
    </strong>
   </p>
   <ol>
    <li>
     结果输出的顺序并不重要，对于上面的例子，&nbsp;
     <code>
      [5, 3]
     </code>
     &nbsp;也是正确答案。
    </li>
    <li>
     你的算法应该具有线性时间复杂度。你能否仅使用常数空间复杂度来实现？
    </li>
   </ol>
  </div>
 </body>
</html>